Duality for distributive bisemilattices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A duality for involutive bisemilattices

It is a common trend in mathematics to study (natural) dualities for general algebraic structures and, in particular, for those arising from mathematical logic. The first step towards this direction traces back to the pioneering work by Stone for Boolean algebras [12]. Later on, Stone duality has been extended to the more general case of distributive lattices by Priestley [8], [9]. The two abov...

متن کامل

Duality for Distributive Spaces

The main source of inspiration for the present paper is the work of R. Rosebrugh and R.J. Wood on constructively completely distributive lattices where the authors elegantly employ the concepts of adjunction and module. Both notions (suitably adapted) are available in topology too, which permits us to investigate topological, metric and other kinds of spaces in a similar spirit. We introduce he...

متن کامل

FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES

The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...

متن کامل

fuzzy ordered sets and duality for finite fuzzy distributive lattices

the starting point of this paper is given by priestley’s papers, where a theory of representation of distributive lattices is presented. the purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. in this way, some results of priestley’s papers are extended. in the main theorem, we show that the category of finite fuzzy priestley space...

متن کامل

Duality of Fix-Points for Distributive Lattices

We present a novel algorithm for calculating x-points. The algorithm calculates x-points of an endo-function f on a distributive lattice, by performing reachability computation a graph derived from the dual of f ; this is in comparison to traditional algorithms that are based on iterated application of f until a x-point is reached.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1991

ISSN: 0263-6115

DOI: 10.1017/s1446788700034224